This paper investigates the capacity regions of two-receiver broadcastchannels where each receiver (i) has both common and private-message requests,and (ii) knows part of the private message requested by the other receiver asside information. We first propose a transmission scheme and derive an innerbound for the two-receiver memoryless broadcast channel. We next prove thatthis inner bound is tight for the deterministic channel and the more capablechannel, thereby establishing their capacity regions. We show that this innerbound is also tight for all classes of two-receiver broadcast channels whosecapacity regions were known prior to this work. Our proposed scheme isconsequently a unified capacity-achieving scheme for these classes of broadcastchannels.
展开▼